1706C - Qpwoeirut And The City - CodeForces Solution

dp flows greedy implementation *1400

Please click on ads to support us..

Python Code: 

 
for i in range(int(input())):
    n = int(input())
    arr = [int(i) for i in input().split()]
    diff_arr = []
    for i in range(1,n-1):
        diff_arr.append(max(0, max(arr[i-1]-arr[i]+1, arr[i+1]-arr[i]+1)))
    if n % 2 == 1:
        res = 0
        for i in range(0,len(diff_arr),2):
            res += diff_arr[i]
        print(res)
    else:
        pos_res = []
        half = len(diff_arr)//2
        green = [diff_arr[i] for i in range(len(diff_arr)) if i%2 == 0]
        red = [diff_arr[i] for i in range(len(diff_arr)) if i%2 == 1]
        green_sum = 0
        red_sum = sum(red)
        for i in range(half + 1):
            pos_res.append(green_sum + red_sum)
            if i < half:
                red_sum -= red[i]
                green_sum += green[i] 
        print(min(pos_res))

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

void solve(){
  int n;
  cin >> n;
  vector<ll> a(n);
  for(int i = 0; i < n; i++)
    cin >> a[i];
  vector<ll> pr(n, 0), sf(n, 0);
  for(int i = 2; i < n; i++)
    pr[i] = max({0ll, a[i-2]+1-a[i-1], a[i]+1-a[i-1]}) + pr[i-2];
  for(int i = n-3; i >= 0; i--)
    sf[i] = max({0ll, a[i]+1-a[i+1], a[i+2]+1-a[i+1]}) + sf[i+2];
  if(n%2){
    cout << pr[n-1] << "\n";
  }
  else{
    ll ans = min(pr[n-2], sf[1]);
    for(int i = 1; i < n; i+= 2)
      ans = min(ans, pr[i-1]+sf[i]);
    cout << ans << "\n";
  }
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt = 1;
  cin >> tt;
  while(tt--){
    solve();
  }
}


Comments

Submit
0 Comments
More Questions

2099. Find Subsequence of Length K With the Largest Sum
1608A - Find Array
416. Partition Equal Subset Sum
1446. Consecutive Characters
1618A - Polycarp and Sums of Subsequences
1618B - Missing Bigram
938. Range Sum of BST
147. Insertion Sort List
310. Minimum Height Trees
2110. Number of Smooth Descent Periods of a Stock
2109. Adding Spaces to a String
2108. Find First Palindromic String in the Array
394. Decode String
902. Numbers At Most N Given Digit Set
221. Maximal Square
1200. Minimum Absolute Difference
1619B - Squares and Cubes
1619A - Square String
1629B - GCD Arrays
1629A - Download More RAM
1629C - Meximum Array
1629D - Peculiar Movie Preferences
1629E - Grid Xor
1629F1 - Game on Sum (Easy Version)
2148. Count Elements With Strictly Smaller and Greater Elements
2149. Rearrange Array Elements by Sign
2150. Find All Lonely Numbers in the Array
2151. Maximum Good People Based on Statements
2144. Minimum Cost of Buying Candies With Discount
Non empty subsets